On the selection of subdivision directions in interval branch-and-bound methods for global optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tools for Simplicial Branch and Bound in Interval Global Optimization∗

Most branch and bound (B&B) algorithms for continuous global optimization work with hyper-rectangles, although some work in the 1970’s dealt with simplexes. More recently, Žilinskas et al have considered branch and bound for Lipschitz optimization, giving examples of how symmetry can be used and how algorithms can be made efficient. Here, in the spirit of that work, we consider simplex-based br...

متن کامل

Multisection in Interval Branch-and-Bound Methods for Global Optimization II. Numerical Tests

We have investigated variants of interval branch-and-bound algorithms for global optimization where the bisection step was substituted by the subdivision of the current, actual interval into many subintervals in a single iteration step. The results are published in two papers, the first one contains the theoretical investigations on the convergence properties. An extensive numerical study indic...

متن کامل

Multisection in Interval Branch-and-Bound Methods for Global Optimization - I. Theoretical Results

We have investigated variants of interval branch-and-bound algorithms for global optimization where the bisection step was substituted by the subdivision of the current, actual interval into many subintervals in a single iteration step. The convergence properties of the multisplitting methods, an important class of multisection procedures are investigated in detail. We also studied theoreticall...

متن کامل

A Review of Subdivision Direction Selection in Interval Methods for Global Optimization

A review of subdivision direction selection in interval methods for global optimization This paper gives a short overview of the latest results on the role of the interval subdivision selection rule in branch-and-bound algorithms for global optimization. The class of rules that allow convergence for two slightly diierent model algorithms is characterized, and it is shown that the four rules inv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Global Optimization

سال: 1995

ISSN: 0925-5001,1573-2916

DOI: 10.1007/bf01097060